全文获取类型
收费全文 | 26784篇 |
免费 | 2941篇 |
国内免费 | 2423篇 |
学科分类
工业技术 | 32148篇 |
出版年
2024年 | 53篇 |
2023年 | 449篇 |
2022年 | 511篇 |
2021年 | 615篇 |
2020年 | 751篇 |
2019年 | 666篇 |
2018年 | 610篇 |
2017年 | 814篇 |
2016年 | 963篇 |
2015年 | 1136篇 |
2014年 | 1571篇 |
2013年 | 1798篇 |
2012年 | 1783篇 |
2011年 | 2084篇 |
2010年 | 1676篇 |
2009年 | 2030篇 |
2008年 | 2146篇 |
2007年 | 2076篇 |
2006年 | 1626篇 |
2005年 | 1405篇 |
2004年 | 1161篇 |
2003年 | 973篇 |
2002年 | 874篇 |
2001年 | 747篇 |
2000年 | 678篇 |
1999年 | 553篇 |
1998年 | 488篇 |
1997年 | 421篇 |
1996年 | 333篇 |
1995年 | 267篇 |
1994年 | 205篇 |
1993年 | 170篇 |
1992年 | 119篇 |
1991年 | 69篇 |
1990年 | 51篇 |
1989年 | 37篇 |
1988年 | 30篇 |
1987年 | 21篇 |
1986年 | 16篇 |
1985年 | 43篇 |
1984年 | 37篇 |
1983年 | 35篇 |
1982年 | 40篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 6篇 |
1978年 | 3篇 |
1977年 | 1篇 |
1976年 | 2篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 342 毫秒
31.
基于交会图和多元统计法的神经网络技术在火山岩识别中的应用 总被引:10,自引:2,他引:8
针对火山岩储层的特殊性(复杂性、离散性和随机性),应用BP神经网络技术对火山岩测井解释中岩性识别问题进行了研究。该方法的技术关键是样本集和初始权重的建立,以及模型的优选。本文提出了一种基于交会图和多元统计法的学习样本生成方法,即根据取心岩样的地球化学和岩石学研究,用交会图技术建立样本集,采用聚类分析和距离判别法确定初始权重。将研究方法应用在松辽盆地杏山地区火山岩岩性识别问题中,取得了很好的效果,岩性解释符合率高于90%。文中通过四种岩性识别处理模式的对比研究,表明赋权重处理模式为最优处理模型。在神经网络模型预测过程中,需充分利用已有的地质经验和测井曲线信息建立典型可靠的样本文件,同时考虑神经网络方法中各种因素的影响,优选模型和计算参数才能使预测结果符合实际情况。 相似文献
32.
The rapid growth of wireless services and mobile users drives a great interest in cellular networks with a hierarchical structure.
Hierarchical cellular networks (HCNs) can provide high system capacity, efficient channel utilization and inherent load-balancing
capability. In this paper, we develop an analytical model and a performance analysis method for a two-layer HCN with bidirectional
overflow and take-back strategies. Mobile users are divided into two classes. The call requests (including new and handoff
calls) of fast and slow users are preferably assigned to the macrolayer and microlayer, respectively. A call from a fast user
or slow user can overflow to its non-preferable layer if there is no channel available. The successful overflow call can be
taken back to its preferable layer if a channel becomes available. Since the commonly used exponentially distributed assumption
for cell residence time and then the channel occupancy time does not hold for emerging mobile networks, we model various cell
residence times by general distributions to adapt to more flexible mobility environments. The channel occupancy times are
derived in terms of the Laplace transforms of various cell residence times. The handoff rates, overflow rates and take-back
rates of each layer are also derived in terms of the new call arrival rates and related probabilities. The stationary probabilities
(and then the performance measures) are determined on the basis of the theory of multi-dimensional loss systems. 相似文献
33.
Efficient multicast search under delay and bandwidth constraints 总被引:1,自引:0,他引:1
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over
only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal
is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has
been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search
cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search
delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost
is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency
between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard.
We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed
strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior
to the implementation of an optimal single user search on a group of users.
Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both
from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California.
From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February
1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University,
Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor
with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York.
Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with
the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks,
mobility, search strategies, and multiple access protocols. 相似文献
34.
35.
36.
Christian Stephan Bernd 《AEUE-International Journal of Electronics and Communications》2006,60(1):20-24
Security for ad hoc network environments has received a lot of attention as of today. Previous work has mainly been focussing on secure routing, fairness issues, and malicious node detection. However, the issue of introducing and conserving trust relationships has received considerably less attention. In this article, we present a scalable method for the use of public key certificates and their revocation in mobile ad hoc networks (MANETs). With the LKN-ad hoc security framework (LKN-ASF) a certificate management protocol has been introduced, bringing PKI technology to MANETs. In addition a performance analysis of two different revocation approaches for MANETs will be presented. 相似文献
37.
38.
39.
动态源路由协议是无线自组织网络众多路由协议中被广泛关注的一种按需路由协议,目前,关于该协议的优化措施有很多。本文先分析了动态源路由协议的一种优化机制——路由自动缩短,该机制能动态缩短处于工作状态路由的跳数,但不保证缩短路由的质量,在此基础上,提出一种自适应路由自动缩短机制,新机制既可缩短路由.又能保证缩短路由质量.理论分析及仿真结果表明,自适应路由缩短机制的各项性能优于原路由缩短机制。 相似文献
40.
Internally buffered multistage interconnection network architectures have been widely used in parallel computer systems and large switching fabrics. Migration from electrical domain to optical domain has raised the necessity of developing node architectures with optical buffers. Cascaded fibre delay line architectures can be seen as possible realizations of output and shared buffering in a 2 × 2‐switching element. These approaches can be used as buffered node architecture in a Banyan like interconnect. In this paper, we investigate and compare these approaches by using simulation methods. Different performance metrics, such as normalized throughput, average packet delay, packet loss rate and buffer utilization have been used under uniform and non‐uniform traffic models. Results show that the TC‐chain node Banyan network offer an improved normalized throughput and average packet delay performances under both traffic models without disrupting first‐in‐first‐out order of arrivals. The switched delay‐line requires fewer switching elements than TC and TTC architectures but at the cost of high packet delay. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献